Parallel Computation of Spectral Portraits of Matrices by Bidiagonalization
نویسندگان
چکیده
منابع مشابه
A fast structure-preserving method for computing the singular value decomposition of quaternion matrices
In this paper we propose a fast structure-preserving algorithm for computing the singular value decomposition of quaternion matrices. The algorithm is based on the structurepreserving bidiagonalization of the real counterpart for quaternion matrices by applying orthogonal JRS-symplectic matrices. The algorithm is efficient and numerically stable. 2014 Elsevier Inc. All rights reserved.
متن کاملA harmonic Lanczos bidiagonalization method for computing interior singular triplets of large matrices
This paper proposes a harmonic Lanczos bidiagonalization method for computing some interior singular triplets of large matrices. It is shown that the approximate singular triplets are convergent if a certain Rayleigh quotient matrix is uniformly bounded and the approximate singular values are well separated. Combining with the implicit restarting technique, we develop an implicitly restarted ha...
متن کاملParallel Computation of Spectral Portraits on the Meiko CS2
We describe a parallel software tool intended for the quantiication of the sensitivity of eigenvalues to matrix perturbations of varying size: the spectral portrait shows a representation of the normwise "-pseudospectra of a matrix A. This requires to compute k(A ? zI) ?1 k 2 for all z in a discretized region of the complex plane. The method used for computing k(A ? zI) ?1 k 2 has to be reliabl...
متن کاملBidiagonalization with Parallel Tiled Algorithms
We consider algorithms for going from a “full” matrix to a condensed “band bidiagonal” form using orthogonal transformations. We use the framework of “algorithms by tiles”. Within this framework, we study: (i) the tiled bidiagonalization algorithm BiDiag, which is a tiled version of the standard scalar bidiagonalization algorithm; and (ii) the R-bidiagonalization algorithm R-BiDiag, which is a ...
متن کاملImplementation of the Orthogonal QD Algorithm for Lower Tridiagonal Matrices
The orthogonal qd algorithm with shifts (oqds algorithm), proposed by von Matt, is an algorithm for computing the singular values of bidiagonal matrices. This algorithm is accurate in terms of relative error, and it is also applicable to general triangular matrices. In particular, for lower tridiagonal matrices, BLAS Level 2.5 routines are available in preprocessing stage for this algorithm. BL...
متن کامل